TSTP Solution File: NUM795^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NUM795^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:15:40 EDT 2024
% Result : Theorem 0.23s 0.39s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 20
% Syntax : Number of formulae : 66 ( 18 unt; 11 typ; 0 def)
% Number of atoms : 222 ( 60 equ; 0 cnn)
% Maximal formula atoms : 3 ( 4 avg)
% Number of connectives : 307 ( 38 ~; 30 |; 0 &; 222 @)
% ( 2 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 8 con; 0-2 aty)
% Number of variables : 60 ( 0 ^ 60 !; 0 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
rat: $tType ).
thf(func_def_0,type,
rat: $tType ).
thf(func_def_1,type,
x0: rat ).
thf(func_def_2,type,
y0: rat ).
thf(func_def_3,type,
z0: rat ).
thf(func_def_4,type,
u0: rat ).
thf(func_def_5,type,
lessis: rat > rat > $o ).
thf(func_def_7,type,
less: rat > rat > $o ).
thf(func_def_8,type,
pl: rat > rat > rat ).
thf(func_def_9,type,
more: rat > rat > $o ).
thf(func_def_10,type,
moreis: rat > rat > $o ).
thf(f62,plain,
$false,
inference(avatar_sat_refutation,[],[f53,f57,f61]) ).
thf(f61,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f60]) ).
thf(f60,plain,
( $false
| spl0_2 ),
inference(subsumption_resolution,[],[f59,f32]) ).
thf(f32,plain,
( ( less @ z0 @ u0 )
= $true ),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
( ( less @ z0 @ u0 )
= $true ),
inference(fool_elimination,[],[f14]) ).
thf(f14,plain,
less @ z0 @ u0,
inference(rectify,[],[f2]) ).
thf(f2,axiom,
less @ z0 @ u0,
file('/export/starexec/sandbox/tmp/tmp.KwQhXZTYm1/Vampire---4.8_12705',k) ).
thf(f59,plain,
( ( ( less @ z0 @ u0 )
!= $true )
| spl0_2 ),
inference(trivial_inequality_removal,[],[f58]) ).
thf(f58,plain,
( ( ( less @ z0 @ u0 )
!= $true )
| ( $true != $true )
| spl0_2 ),
inference(superposition,[],[f52,f37]) ).
thf(f37,plain,
! [X0: rat,X1: rat] :
( ( ( more @ X0 @ X1 )
= $true )
| ( ( less @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[],[f29]) ).
thf(f29,plain,
! [X0: rat,X1: rat] :
( ( ( more @ X0 @ X1 )
= $true )
| ( ( less @ X1 @ X0 )
!= $true ) ),
inference(ennf_transformation,[],[f11]) ).
thf(f11,plain,
! [X1: rat,X0: rat] :
( ( ( less @ X1 @ X0 )
= $true )
=> ( ( more @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
! [X0: rat,X1: rat] :
( ( less @ X1 @ X0 )
=> ( more @ X0 @ X1 ) ),
inference(rectify,[],[f6]) ).
thf(f6,axiom,
! [X1: rat,X0: rat] :
( ( less @ X0 @ X1 )
=> ( more @ X1 @ X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.KwQhXZTYm1/Vampire---4.8_12705',satz83) ).
thf(f52,plain,
( ( ( more @ u0 @ z0 )
!= $true )
| spl0_2 ),
inference(avatar_component_clause,[],[f50]) ).
thf(f50,plain,
( spl0_2
<=> ( ( more @ u0 @ z0 )
= $true ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f57,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f56]) ).
thf(f56,plain,
( $false
| spl0_1 ),
inference(subsumption_resolution,[],[f55,f36]) ).
thf(f36,plain,
( ( lessis @ x0 @ y0 )
= $true ),
inference(cnf_transformation,[],[f21]) ).
thf(f21,plain,
( ( lessis @ x0 @ y0 )
= $true ),
inference(fool_elimination,[],[f20]) ).
thf(f20,plain,
lessis @ x0 @ y0,
inference(rectify,[],[f1]) ).
thf(f1,axiom,
lessis @ x0 @ y0,
file('/export/starexec/sandbox/tmp/tmp.KwQhXZTYm1/Vampire---4.8_12705',l) ).
thf(f55,plain,
( ( ( lessis @ x0 @ y0 )
!= $true )
| spl0_1 ),
inference(trivial_inequality_removal,[],[f54]) ).
thf(f54,plain,
( ( ( lessis @ x0 @ y0 )
!= $true )
| ( $true != $true )
| spl0_1 ),
inference(superposition,[],[f48,f33]) ).
thf(f33,plain,
! [X0: rat,X1: rat] :
( ( ( moreis @ X0 @ X1 )
= $true )
| ( $true
!= ( lessis @ X1 @ X0 ) ) ),
inference(cnf_transformation,[],[f30]) ).
thf(f30,plain,
! [X0: rat,X1: rat] :
( ( $true
!= ( lessis @ X1 @ X0 ) )
| ( ( moreis @ X0 @ X1 )
= $true ) ),
inference(rectify,[],[f28]) ).
thf(f28,plain,
! [X1: rat,X0: rat] :
( ( ( lessis @ X0 @ X1 )
!= $true )
| ( ( moreis @ X1 @ X0 )
= $true ) ),
inference(ennf_transformation,[],[f19]) ).
thf(f19,plain,
! [X1: rat,X0: rat] :
( ( ( lessis @ X0 @ X1 )
= $true )
=> ( ( moreis @ X1 @ X0 )
= $true ) ),
inference(fool_elimination,[],[f18]) ).
thf(f18,plain,
! [X0: rat,X1: rat] :
( ( lessis @ X0 @ X1 )
=> ( moreis @ X1 @ X0 ) ),
inference(rectify,[],[f5]) ).
thf(f5,axiom,
! [X0: rat,X1: rat] :
( ( lessis @ X0 @ X1 )
=> ( moreis @ X1 @ X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.KwQhXZTYm1/Vampire---4.8_12705',satz85) ).
thf(f48,plain,
( ( $true
!= ( moreis @ y0 @ x0 ) )
| spl0_1 ),
inference(avatar_component_clause,[],[f46]) ).
thf(f46,plain,
( spl0_1
<=> ( $true
= ( moreis @ y0 @ x0 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f53,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f44,f50,f46]) ).
thf(f44,plain,
( ( ( more @ u0 @ z0 )
!= $true )
| ( $true
!= ( moreis @ y0 @ x0 ) ) ),
inference(trivial_inequality_removal,[],[f41]) ).
thf(f41,plain,
( ( $true != $true )
| ( $true
!= ( moreis @ y0 @ x0 ) )
| ( ( more @ u0 @ z0 )
!= $true ) ),
inference(superposition,[],[f40,f34]) ).
thf(f34,plain,
! [X2: rat,X3: rat,X0: rat,X1: rat] :
( ( $true
= ( more @ ( pl @ X0 @ X3 ) @ ( pl @ X1 @ X2 ) ) )
| ( ( moreis @ X0 @ X1 )
!= $true )
| ( $true
!= ( more @ X3 @ X2 ) ) ),
inference(cnf_transformation,[],[f31]) ).
thf(f31,plain,
! [X0: rat,X1: rat,X2: rat,X3: rat] :
( ( $true
!= ( more @ X3 @ X2 ) )
| ( ( moreis @ X0 @ X1 )
!= $true )
| ( $true
= ( more @ ( pl @ X0 @ X3 ) @ ( pl @ X1 @ X2 ) ) ) ),
inference(rectify,[],[f26]) ).
thf(f26,plain,
! [X0: rat,X1: rat,X3: rat,X2: rat] :
( ( ( more @ X2 @ X3 )
!= $true )
| ( ( moreis @ X0 @ X1 )
!= $true )
| ( ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X3 ) )
= $true ) ),
inference(flattening,[],[f25]) ).
thf(f25,plain,
! [X3: rat,X0: rat,X2: rat,X1: rat] :
( ( ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X3 ) )
= $true )
| ( ( more @ X2 @ X3 )
!= $true )
| ( ( moreis @ X0 @ X1 )
!= $true ) ),
inference(ennf_transformation,[],[f17]) ).
thf(f17,plain,
! [X3: rat,X0: rat,X2: rat,X1: rat] :
( ( ( moreis @ X0 @ X1 )
= $true )
=> ( ( ( more @ X2 @ X3 )
= $true )
=> ( ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X3 ) )
= $true ) ) ),
inference(fool_elimination,[],[f16]) ).
thf(f16,plain,
! [X0: rat,X1: rat,X2: rat,X3: rat] :
( ( moreis @ X0 @ X1 )
=> ( ( more @ X2 @ X3 )
=> ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X3 ) ) ) ),
inference(rectify,[],[f4]) ).
thf(f4,axiom,
! [X0: rat,X1: rat,X2: rat,X3: rat] :
( ( moreis @ X0 @ X1 )
=> ( ( more @ X2 @ X3 )
=> ( more @ ( pl @ X0 @ X2 ) @ ( pl @ X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.KwQhXZTYm1/Vampire---4.8_12705',satz99a) ).
thf(f40,plain,
( ( more @ ( pl @ y0 @ u0 ) @ ( pl @ x0 @ z0 ) )
!= $true ),
inference(trivial_inequality_removal,[],[f39]) ).
thf(f39,plain,
( ( ( more @ ( pl @ y0 @ u0 ) @ ( pl @ x0 @ z0 ) )
!= $true )
| ( $true != $true ) ),
inference(superposition,[],[f35,f38]) ).
thf(f38,plain,
! [X0: rat,X1: rat] :
( ( ( less @ X0 @ X1 )
= $true )
| ( ( more @ X1 @ X0 )
!= $true ) ),
inference(cnf_transformation,[],[f27]) ).
thf(f27,plain,
! [X0: rat,X1: rat] :
( ( ( more @ X1 @ X0 )
!= $true )
| ( ( less @ X0 @ X1 )
= $true ) ),
inference(ennf_transformation,[],[f23]) ).
thf(f23,plain,
! [X0: rat,X1: rat] :
( ( ( more @ X1 @ X0 )
= $true )
=> ( ( less @ X0 @ X1 )
= $true ) ),
inference(fool_elimination,[],[f22]) ).
thf(f22,plain,
! [X0: rat,X1: rat] :
( ( more @ X1 @ X0 )
=> ( less @ X0 @ X1 ) ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
! [X1: rat,X0: rat] :
( ( more @ X0 @ X1 )
=> ( less @ X1 @ X0 ) ),
file('/export/starexec/sandbox/tmp/tmp.KwQhXZTYm1/Vampire---4.8_12705',satz82) ).
thf(f35,plain,
( ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) )
!= $true ),
inference(cnf_transformation,[],[f24]) ).
thf(f24,plain,
( ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) )
!= $true ),
inference(flattening,[],[f13]) ).
thf(f13,plain,
( ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) )
!= $true ),
inference(fool_elimination,[],[f12]) ).
thf(f12,plain,
~ ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) ),
inference(rectify,[],[f8]) ).
thf(f8,negated_conjecture,
~ ( less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ) ),
inference(negated_conjecture,[],[f7]) ).
thf(f7,conjecture,
less @ ( pl @ x0 @ z0 ) @ ( pl @ y0 @ u0 ),
file('/export/starexec/sandbox/tmp/tmp.KwQhXZTYm1/Vampire---4.8_12705',satz99c) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUM795^1 : TPTP v8.1.2. Released v3.7.0.
% 0.15/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.36 % Computer : n004.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 14:53:38 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.15/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.KwQhXZTYm1/Vampire---4.8_12705
% 0.23/0.38 % (12967)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.23/0.38 % (12967)Instruction limit reached!
% 0.23/0.38 % (12967)------------------------------
% 0.23/0.38 % (12967)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.38 % (12967)Termination reason: Unknown
% 0.23/0.38 % (12967)Termination phase: Preprocessing 2
% 0.23/0.38
% 0.23/0.38 % (12967)Memory used [KB]: 895
% 0.23/0.38 % (12967)Time elapsed: 0.003 s
% 0.23/0.38 % (12967)Instructions burned: 2 (million)
% 0.23/0.38 % (12967)------------------------------
% 0.23/0.38 % (12967)------------------------------
% 0.23/0.38 % (12964)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.23/0.38 % (12966)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.23/0.38 % (12968)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.23/0.38 % (12965)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.23/0.38 % (12969)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.23/0.38 % (12970)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.23/0.38 % (12971)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.23/0.38 % (12968)Instruction limit reached!
% 0.23/0.38 % (12968)------------------------------
% 0.23/0.38 % (12968)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.38 % (12968)Termination reason: Unknown
% 0.23/0.38 % (12968)Termination phase: Property scanning
% 0.23/0.38
% 0.23/0.38 % (12968)Memory used [KB]: 895
% 0.23/0.38 % (12968)Time elapsed: 0.003 s
% 0.23/0.38 % (12968)Instructions burned: 2 (million)
% 0.23/0.38 % (12968)------------------------------
% 0.23/0.38 % (12968)------------------------------
% 0.23/0.38 % (12965)Instruction limit reached!
% 0.23/0.38 % (12965)------------------------------
% 0.23/0.38 % (12965)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.38 % (12965)Termination reason: Unknown
% 0.23/0.38 % (12965)Termination phase: Saturation
% 0.23/0.38
% 0.23/0.38 % (12965)Memory used [KB]: 5500
% 0.23/0.38 % (12965)Time elapsed: 0.004 s
% 0.23/0.38 % (12965)Instructions burned: 4 (million)
% 0.23/0.38 % (12965)------------------------------
% 0.23/0.38 % (12965)------------------------------
% 0.23/0.38 % (12971)Instruction limit reached!
% 0.23/0.38 % (12971)------------------------------
% 0.23/0.38 % (12971)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.38 % (12971)Termination reason: Unknown
% 0.23/0.38 % (12969)First to succeed.
% 0.23/0.39 % (12971)Termination phase: Saturation
% 0.23/0.39
% 0.23/0.39 % (12971)Memory used [KB]: 5500
% 0.23/0.39 % (12971)Time elapsed: 0.005 s
% 0.23/0.39 % (12971)Instructions burned: 4 (million)
% 0.23/0.39 % (12971)------------------------------
% 0.23/0.39 % (12971)------------------------------
% 0.23/0.39 % (12970)Also succeeded, but the first one will report.
% 0.23/0.39 % (12966)Also succeeded, but the first one will report.
% 0.23/0.39 % (12969)Refutation found. Thanks to Tanya!
% 0.23/0.39 % SZS status Theorem for Vampire---4
% 0.23/0.39 % SZS output start Proof for Vampire---4
% See solution above
% 0.23/0.39 % (12969)------------------------------
% 0.23/0.39 % (12969)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.23/0.39 % (12969)Termination reason: Refutation
% 0.23/0.39
% 0.23/0.39 % (12969)Memory used [KB]: 5500
% 0.23/0.39 % (12969)Time elapsed: 0.006 s
% 0.23/0.39 % (12969)Instructions burned: 3 (million)
% 0.23/0.39 % (12969)------------------------------
% 0.23/0.39 % (12969)------------------------------
% 0.23/0.39 % (12963)Success in time 0.007 s
% 0.23/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------